Fraenkel’s axiom of restriction: Axiom choice, intended models and categoricity
نویسندگان
چکیده
A recent debate has focused on different methodological principles underlying the practice of axiom choice in mathematics (cf. Feferman et al., 2000; Maddy, 1997; Easwaran, 2008). The general aim of these contributions can be described as twofold: first to clarify the spectrum of informal justification strategies retraceable in the history of mathematical axiomatics. Second, to evaluate and to philosophically reflect on the actual reasoning involved in the introduction of new axioms in mathematical practice such as large cardinal axioms in set theory. The most extensive treatment of these matters for the case of set theory can be found in (Maddy, 1997). Her philosophical discussion of axiom choice covers both of the mentioned approaches, i.e., it is both descriptive in reconstructing the justification types in early axiomatic set theory as well as normative in devising “methodological maxims” for the evaluation of present set theoretic axiom candidates. More specifically, Section 1.3 of her book provides a historical survey of the arguments given for ZFC by Zermelo, von Neumann, and Fraenkel (among others) with the intention “to explicate and analyze its distinctive modes of justification” given there (Maddy, 1997, p. 72). In the final two sections of her book (Sections 3.5 and 3.6), Maddy in turn devises “a naturalistic program” for discussing more recent axiom candidates (starting from Gödel’s axiom of constructibility to large cardinal or determinacy axioms) intended to model the “justificatory structure of contemporary set theory” (Maddy, 1997, p. 194). In this paper I attempt to take up Maddy’s historical discussion by drawing attention to a historical episode from early axiomatic set theory centered on Abraham Fraenkel’s axiom of restriction (“Beschränktheitsaxiom”) (in the following AR). The axiom candidate was first introduced by Fraenkel in the early 1920s and can be considered as a minimal axiom devised to
منابع مشابه
On characterizations of the fully rational fuzzy choice functions
In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.
متن کاملOn Tychonoff's type theorem via grills
Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces, and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$. We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ related to these grills, and present a simple proof to this theorem. This immediately yields the classical theorem...
متن کاملTHE URYSOHN AXIOM AND THE COMPLETELY HAUSDORFF AXIOM IN L-TOPOLOGICAL SPACES
In this paper, the Urysohn and completely Hausdorff axioms in general topology are generalized to L-topological spaces so as to be compatible with pointwise metrics. Some properties and characterizations are also derived
متن کاملReview of “ Forcing over models of determinacy ” by Paul Larson Ralf Schindler
The forcing Pmax is entirely due to W. Hugh Woodin. It arose out of earlier work of J. Steel and R. Van Wesep, cf. [StVW82], who had shown that ZFC plus “δ2 = א2” plus “NSω1 is saturated” is consistent relative to ZF plus AD plus R–AC. ZF denotes Zermelo–Fraenkel’s axiomatization of set theory without any form of the axiom of choice, and ZFC is ZF with AC, the full axiom of choice. R–AC denotes...
متن کاملSummable gaps
It is proved, under Martin’s Axiom, that all (ω1, ω1) gaps in P(N) / fin are indestructible in any forcing extension by a separable measure algebra. This naturally leads to a new type of gap, a summable gap. The results of these investigations have applications in Descriptive Set Theory. For example, it is shown that under Martin’s Axiom the Baire categoricity of all ∆3 non-∆ 1 3-complete sets ...
متن کامل